|
In logic, a rule of inference, inference rule or transformation rule is a logical form consisting of a function which takes premises, analyzes their syntax, and returns a conclusion (or conclusions). For example, the rule of inference called ''modus ponens'' takes two premises, one in the form "If p then q" and another in the form "p", and returns the conclusion "q". The rule is valid with respect to the semantics of classical logic (as well as the semantics of many other non-classical logics), in the sense that if the premises are true (under an interpretation), then so is the conclusion. Typically, a rule of inference preserves truth, a semantic property. In many-valued logic, it preserves a general designation. But a rule of inference's action is purely syntactic, and does not need to preserve any semantic property: any function from sets of formulae to formulae counts as a rule of inference. Usually only rules that are recursive are important; i.e. rules such that there is an effective procedure for determining whether any given formula is the conclusion of a given set of formulae according to the rule. An example of a rule that is not effective in this sense is the infinitary ω-rule. Popular rules of inference in propositional logic include ''modus ponens'', ''modus tollens'', and contraposition. First-order predicate logic uses rules of inference to deal with logical quantifiers. ==The standard form of rules of inference== In formal logic (and many related areas), rules of inference are usually given in the following standard form: Premise#1 Premise#2 ... Premise#n Conclusion This expression states that whenever in the course of some logical derivation the given premises have been obtained, the specified conclusion can be taken for granted as well. The exact formal language that is used to describe both premises and conclusions depends on the actual context of the derivations. In a simple case, one may use logical formulae, such as in: : : : This is the ''modus ponens'' rule of propositional logic. Rules of inference are often formulated as schemata employing metavariables.〔 In the rule (schema) above, the metavariables A and B can be instantiated to any element of the universe (or sometimes, by convention, a restricted subset such as propositions) to form an infinite set of inference rules. A proof system is formed from a set of rules chained together to form proofs, also called ''derivations''. Any derivation has only one final conclusion, which is the statement proved or derived. If premises are left unsatisfied in the derivation, then the derivation is a proof of a ''hypothetical'' statement: "''if'' the premises hold, ''then'' the conclusion holds." 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Rule of inference」の詳細全文を読む スポンサード リンク
|